Lookahead Saturation with Restriction for SAT
نویسندگان
چکیده
We present a new and more efficient heuristic by restricting lookahead saturation (LAS) with NVO (neighbourhood variable ordering) and DEW (dynamic equality weighting). We report on the integration of this heuristic in Satz, a high-performance SAT solver, showing empirically that it significantly improves the performance on an extensive range of benchmark problems that exhibit hard structure.
منابع مشابه
Towards a Lookahead Sat Solver for General Purposes towards a Lookahead Sat Solver for General Purposes
The DPLL framework with a lookahead procedure that determines the branching variable is a powerful tandem to solve a wide range of satisfiability problems. It outperforms all other techniques on random CNF formulas. This thesis presents the solver march, which is based on this architecture and focuses on general fast performance. To achieve this goal, this thesis proposes a new kind of pre-sele...
متن کاملMarch eq: Implementing Efficiency and Additional Reasoning into a Lookahead SAT-Solver
In this paper, several techniques are discussed that make the lookahead architecture for satisfiability (Sat) solvers more competing. Our contribution consists of reduction of the computational costs to perform lookahead and the cheap integration of both equivalence reasoning and local learning. Most proposed techniques are illustrated with experimental results of their implementation in our so...
متن کاملFunction-Complete Lookahead in Support of Efficient SAT Search Heuristics
Recent work has shown the value of using propositional SAT solvers, as opposed to pure BDD solvers, for solving many real-world Boolean Satisfiability problems including Bounded Model Checking problems (BMC). We propose a SAT solver paradigm which combines the use of BDDs and search methods to support efficient implementation of complex search heuristics and effective use of early (preprocessor...
متن کاملMultiple Preprocessing for Systematic SAT Solvers
High-performance SAT solvers based on systematic search generally use either conflict driven clause learning (CDCL) or lookahead techniques to gain efficiency. Both styles of reasoning can gain from a preprocessing phase in which some form of deduction is used to simplify the problem. In this paper we undertake an empirical examination of the effects of several recently proposed preprocessors o...
متن کاملPhase Selection Heuristics for Satisfiability Solvers
In general, a SAT Solver based on conflict-driven DPLL consists of variable selection, phase selection, Boolean Constraint Propagation, conflict analysis, clause learning and its database maintenance. Optimizing any part of these components can enhance the performance of a solver. This paper focuses on optimizing phase selection. Although the ACE (Approximation of the Combined lookahead Evaluat...
متن کامل